#include<bits/stdc++.h>
using namespace std;
int n,t;
int r[100005];
int h[100005];
int cnt,ans;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&t);
        if(!r[t]) h[++cnt]=t;
        r[t]++;
    }
    sort(h,h+cnt+1);
    for(int i=1;i<=cnt;i++)
        ans=max(ans,r[h[i]]);
    printf("%d\n",ans);
    return 0;
}
